Theoretical Foundations for Greedy Methods
نویسنده
چکیده
منابع مشابه
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by Basis Pursuit has recently been studied by several authors, we provide theoretical results on the success probability of reconstruction via Thresholding and ...
متن کاملEffectiveness of Teaching General Courses on Theoretical Foundations of Islam on Religious Identity and Academic Resilience of Sports Science Students at Ilam University
Background and objectives: Promoting the theoretical foundations of Islam has a role in determining the individual and social behavior of students. Therefore, this study aimed to investigate the effect of teaching general courses on the theoretical foundations of Islam on the religious identity and academic resilience of Sports Science students at Ilam University. Materials and Methods: The me...
متن کاملFractional Coverings, Greedy Coverings, and Rectifier Networks
A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix M that has a 1 in the entry (i, j) iff there is a path from the jth source to the ith sink. The smallest number of edges in a rectifier network that computes M is a classic complexity measure on matrices, which has been studied for more than half a century. We explore two...
متن کاملAn "hp" Certified Reduced Basis Method for Parametrized Elliptic Partial Differential Equations
We present a new “hp” parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized elliptic partial differential equations. We propose a new procedure and attendant theoretical foundations for adaptive partition of the parameter domain into parameter subdomains (“h”-refinement); subsequently, we construct indiv...
متن کاملOn Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on th...
متن کامل